Expected utility without bounds—A simple proof
نویسندگان
چکیده
We provide a simple proof for the existence of an expected utility representation of a preference relation with an unbounded and continuous utility function. © 2014 Elsevier B.V. All rights reserved.
منابع مشابه
Simple Bounds and Monotonicity Results for Finite Multi-Server Exponential Tandem Queues
Simple and computationally attractive lower and upper bounds are presented for the call congestion such as those representing multi-server loss or delay stations. Numerical computations indicate a potential usefulness of the bounds for quick engineering purposes. The bounds correspond to product-form modifications and are intuitively appealing. A formal proof of the bounds and related mono toni...
متن کاملSharp Convex Bounds on the Aggregate Sums–An Alternative Proof
It is well known that a random vector with given marginals is comonotonic if and only if it has the largest convex sum, and that a random vector with given marginals (under an additional condition) is mutually exclusive if and only if it has the minimal convex sum. This paper provides an alternative proof of these two results using the theories of distortion risk measure and expected utility.
متن کاملSimple Bounds for Queueing Systems with Breakdowns
Computationally attractive and intuitively obvious simple bounds are proposed for finite service systems which are subject to random breakdowns. The services are assumed to be exponential. The up and down periods are allowed to be generally distributed. The bounds are based on product-form modifications and depend only on means. A formal proof is presented. This proof is of interest in itself. ...
متن کاملA decision rule for imprecise probabilities based on pair-wise comparison of expectation bounds
There are many ways to extend the classical expected utility decision rule to the case where uncertainty is described by (convex) probability sets. In this paper, we propose a simple new decision rule based on the pair-wise comparison of lower and upper expected bounds. We compare this rule to other rules proposed in the literature, showing that this new rule is both precise, computationally tr...
متن کاملRenegotiation-Proof Contracts in Repeated Agency
Renegotiation-proof contracts are studied in infinitely repeated principalagent contracting. Contracts satisfying a weaker notion of renegotiationproofness always exist. With risk neutrality, efficient full-commitment contracts are renegotiation-proof if the agent’s expected lifetime utility is above a critical level; otherwise or if the agent is risk averse then efficient fullcommitment contra...
متن کامل